منابع مشابه
Processes of timed Petri nets
Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without specifying when particular situations appear (free processes), or together with the respective appearan...
متن کاملTimed Processes of Interval-Timed Petri Nets
In this paper we use partial order semantics to express the truly concurrent behaviour of interval-timed Petri nets (ITPNs) in their most general setting, i.e. with autoconcurrency and zero duration, as studied with its standard maximal step semantics in [8]. First we introduce the notion of timed processes for ITPNs inductively. Then we investigate if the equivalence of inductive and axiomatic...
متن کاملAlgebras of Processes of Timed Petri Nets
Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel. The processes can be represented either without specifying when particular situations appear (free time-consuming processes), or together with the respective appearance times (timed...
متن کاملTimed Petri Nets
In the early 60’s a young researcher in Darmstadt looked for a good representation for communicating systems processes that were mathematically sound and had, at the same time, a visual intuitive flavor. This event marked the beginning of a schematic approach that become very important to the modeling of distributed systems in several and distinct areas of knowledge, from Engineering to biologi...
متن کاملPriced Timed Petri Nets
We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model assigns token storage costs per time unit to places, and firing costs to transitions. This general model strictly subsumes both priced timed automata and unbound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00188-1